On two related questions of Wilf concerning Standard Young Tableaux
نویسنده
چکیده
We consider two questions ofWilf related to Standard Young Tableaux. We provide a partial answer to one question, and that will lead us to a more general answer to the other question. Our answers are purely combinatorial.
منابع مشابه
On Selecting a Random Shifted Young Tableau
The study of standard and generalized Young tableaux has led to interesting results in quite a number of areas of mathematics. These arrays are of importance in the representation theory of the symmetric and general linear groups [12], in invariant theory [7], and in connection with various combinatorial problems [ 11. In addition, many algorithms have been developed that manipulate the tableau...
متن کاملSubsequence Containment by Involutions
Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in Sn which contain a given permutation τ ∈ Sk as a subsequence; this number depends on the patterns of the first j values of τ for 1 ≤ j ≤ k. We then use this to define a partition of Sk, analogous to Wilf-classes in the study of pattern avoidance, and examine properties of this equivalence. In the process, w...
متن کامل2 S ep 2 00 4 Subsequence containment by involutions
Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in Sn which contain a given permutation τ ∈ Sk as a subsequence; this number depends on the patterns of the first j values of τ for 1 ≤ j ≤ k. We then use this to define a partition of Sk, analogous to Wilf-classes in the study of pattern avoidance, and examine properties of this equivalence. In the process, w...
متن کاملAsymptotics for the Distributions of Subtableaux in Young and Up-Down Tableaux
Let μ be a partition of k, and T a standard Young tableau of shape μ. McKay, Morse, and Wilf show that the probability a randomly chosen Young tableau of N cells contains T as a subtableau is asymptotic to fμ/k! as N goes to infinity, where fμ is the number of all tableaux of shape μ. We use a random-walk argument to show that the analogous asymptotic probability for randomly chosen Young table...
متن کاملAscending Subsequences of Permutations and the Shapes of Tableaux
We nd an interesting relationship between two diicult counting problems in the theory of symmetric functions. For integer k 1, let y k (n) denote the number of standard Young tableaux on n cells whose rst row is of length k, and let Y k (x) = P n0 y k (n)x n =n!: Let u k (n) be the number of permutations of n letters that have no ascending subse-quence of length > k, and let U k (x) = P n0 u k ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 30 شماره
صفحات -
تاریخ انتشار 2009